Approximate Reasoning Using Fodor’s Implication
نویسندگان
چکیده
Using generalized modus ponens reasoning, we examine the values of the inferred conclusion using the Fodor’s implication in order to interpret a fuzzy if-then rule with a single input single output and the T-norms t1(x, y) = min(x, y), t2(x, y) = xy and t3(x, y) = max(0, x + y − 1) for composition operation. These are the very used T-norms in generalized modus ponens reasoning.
منابع مشابه
PROPERTY ANALYSIS OF TRIPLE IMPLICATION METHOD FOR APPROXIMATE REASONING ON ATANASSOVS INTUITIONISTIC FUZZY SETS
Firstly, two kinds of natural distances between intuitionistic fuzzy sets are generated by the classical natural distance between fuzzy sets under a unified framework of residual intuitionistic implication operators. Secondly, the continuity and approximation property of a method for solving intuitionistic fuzzy reasoning are defined. It is proved that the triple implication method for intuitio...
متن کاملPossibilistic Residuated Implication Logics and Applications
In this paper, we will develop a class of logics for reasoning about qualitative and quantitative uncertainty. The semantics of the logics is uniformly based on possibility theory. Each logic in the class is parameterized by a t-norm operation on 0,1], and we express the degree of implication between the possibilities of two formulas explicitly by using residuated implication with respect to th...
متن کاملApproximate Reasoning in Surgical Decisions
Approximate reasoning is one of the most effective fuzzy systems. The compositional rule of inference founded on the logical law modus ponens is furnished with a true conclusion, provided that the premises of the rule are true as well. Even though there exist different approaches to an implication, being the crucial part of the rule, we modify the early implication proposed by Zadeh [1] in our ...
متن کاملPossibilistic Residuated Implication Logics with Applications
In this paper, we will develop a class of logics for reasoning about qualitative and quantitative uncertainty. The semantics of the logics is uniformly based on possibility theory. Each logic in the class is parameterized by a t-norm operation on [0,1], and we express the degree of implication between the possibilities of two formulas explicitly by using residuated implication with respect to t...
متن کاملEfficient Algorithms for Approximate Reasoning
We present algorithms for approximate reasoning computations, for some intersection and implication functions, which are as efficient as Mamdani’s interpolation method. Implementations of the algorithms are given in the functional language Mi r a n d a.
متن کامل